Godsil-McKay switching and isomorphism
نویسندگان
چکیده
Godsil-McKay switching is an operation on graphs that doesn’t change the spectrum of the adjacency matrix. Usually (but not always) the obtained graph is non-isomorphic with the original graph. We present a straightforward sufficient condition for being isomorphic after switching, and give examples which show that this condition is not necessary. For some graph products we obtain sufficient conditions for being non-isomorphic after switching. As an example we find that the tensor product of the grid L(`,m) (` > m ≥ 2) and a graph with at least one vertex of degree two is not determined by its adjacency spectrum.
منابع مشابه
Graph Cospectrality using Neighborhood Matrices
In this note we address the problem of graph isomorphism by means of eigenvalue spectra of different matrix representations: the neighborhood matrix M̂ , its corresponding signless Laplacian QM̂ , and the set of higher order adjacency matrices M`s. We find that, in relation to graphs with at most 10 vertices, QM̂ leads to better results than the signless Laplacian Q; besides, when combined with M̂ ...
متن کاملCospectral mates for the union of some classes in the Johnson association scheme
Let n ≥ k ≥ 2 be two integers and S a subset of {0, 1, . . . , k − 1}. The graph JS(n, k) has as vertices the k-subsets of the n-set [n] = {1, . . . , n} and two k-subsets A and B are adjacent if |A ∩ B| ∈ S. In this paper, we use Godsil-McKay switching to prove that for m ≥ 0, k ≥ max(m + 2, 3) and S = {0, 1, ...,m}, the graphs JS(3k − 2m − 1, k) are not determined by spectrum and for m ≥ 2, n...
متن کاملUnification of Graph Products and Compatibility with Switching
We define the type of graph products, which enable us to treat many graph products in a unified manner. These unified graph products are shown to be compatible with Godsil–McKay switching. Furthermore, by this compatibility, we show that the Doob graphs can also be obtained from the Hamming graphs by switching.
متن کاملPartitioned Tensor Products and Their Spectra
A pleasant family of graphs defined by Godsil and McKay is shown to have easily computed eigenvalues in many cases.
متن کامل